take the logarithm

См. также в других словарях:

• Logarithm — The graph of the logarithm to base 2 crosses the x axis (horizontal axis) at 1 and passes through the points with coordinates (2, 1), (4, 2), and (8, 3) …   Wikipedia

• Logarithm of a matrix — In mathematics, a logarithm of a matrix is another matrix such that the matrix exponential of the latter matrix equals the original matrix. It is thus a generalization of the scalar logarithm and in some sense an inverse function of the matrix… …   Wikipedia

• Indefinite logarithm — The indefinite logarithm of a positive number n (variously denoted [log n] , mathrm{Log}(n) or even sometimes just log n) is the logarithm without regard to any particular base: it is a function (of the base), not a number . This is as opposed to …   Wikipedia

• Natural logarithm — Base e redirects here. For the numbering system which uses e as its base, see Non integer representation#Base e. Graph of the natural logarithm function. The function slowly grows to positive infinity as x increases and rapidly goes to negative… …   Wikipedia

• Discrete logarithm — In mathematics, specifically in abstract algebra and its applications, discrete logarithms are group theoretic analogues of ordinary logarithms. In particular, an ordinary logarithm loga(b) is a solution of the equation ax = b over the… …   Wikipedia

• Characterizations of the exponential function — In mathematics, the exponential function can be characterized in many ways. The following characterizations (definitions) are most common. This article discusses why each characterization makes sense, and why the characterizations are independent …   Wikipedia

• Proofs involving the totient function — This page provides proofs for identities involving the totient function varphi(k) and the Möbius function mu(k).um of integers relatively prime to and less than or equal to n Claim::sum {1le kle n atop {gcd(k,n)=1 k = frac{1}{2} , varphi(n) ,… …   Wikipedia

• Okamoto–Uchiyama cryptosystem — The Okamoto–Uchiyama cryptosystem was discovered in 1998 by T. Okamoto and S. Uchiyama. The system works in the group , where n is of the form p2q and p and q are large primes. Contents 1 Scheme definition 1.1 Key generation …   Wikipedia

• Okamoto-Uchiyama cryptosystem — The Okamoto Uchiyama Cryptosystem was discovered in 1998 by T. Okamoto and S. Uchiyama. The system works in the group (mathbb{Z}/nmathbb{Z})^*, where n is of the form p 2 q . The Okamoto Uchiyama cryptosystem is a precursor to the Paillier… …   Wikipedia

• Viterbi algorithm — The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states ndash; called the Viterbi path ndash; that results in a sequence of observed events, especially in the context of Markov information… …   Wikipedia

• Mathematical fallacy — In mathematics, certain kinds of mistakes in proof, calculation, or derivation are often exhibited, and sometimes collected, as illustrations of the concept of mathematical fallacy. The specimens of the greatest interest can be seen as… …   Wikipedia